Independent Semitotal Domination in the Join of Graphs
نویسندگان
چکیده
A subset W \(\subseteq\) V (G) of a graph G is an independent semitotal dominating set G, abbreviated ISTd-set if and every element exactly distance 2 from at least one other W. The domination number denoted by \(\gamma\)it2(G), the minimum cardinality G. In this paper, we study concept in graphs investigate conditions for on which ISTd-sets exist. Further, join any two are examined. Consequently, corresponding these obtained.
منابع مشابه
Algorithmic Aspects of Semitotal Domination in Graphs
For a graph G = (V,E), a set D ⊆ V is called a semitotal dominating set of G if D is a dominating set of G, and every vertex in D is within distance 2 of another vertex of D. The Minimum Semitotal Domination problem is to find a semitotal dominating set of minimum cardinality. Given a graph G and a positive integer k, the Semitotal Domination Decision problem is to decide whether G has a semito...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملComplexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کاملSIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.
متن کاملSecure Restrained Domination in the Join and Corona of Graphs
Let G be a connected simple graph. A restrained dominating set S of the vertex set of G, V (G) is a secure restrained dominating set of G if for each u ∈ V (G) \ S, there exists v ∈ S such that uv ∈ E(G) and the set (S \ {v}) ∪ {u} is a restrained dominating set of G. The minimum cardinality of a secure restrained dominating set of G, denoted by γsr(G), is called the secure restrained dominatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asian research journal of mathematics
سال: 2023
ISSN: ['2456-477X']
DOI: https://doi.org/10.9734/arjom/2023/v19i3647